Journal of Beijing University of Posts and Telecommunications

  • EI核心期刊

JOURNAL OF BEIJING UNIVERSITY OF POSTS AND TELECOM ›› 2011, Vol. 34 ›› Issue (3): 94-97.doi: 10.13190/jbupt.201103.94.gaolx

• Reports • Previous Articles     Next Articles

An Algorithm for Mining Passenger Flow  Information from Smart Card Data

  

  • Received:2010-06-28 Revised:2011-02-07 Online:2011-06-28 Published:2011-03-29
  • Contact: Lian-Xiong GAO E-mail:gaolianxiong@gmail.com

Abstract:

To collect passenger flow information of public transit from the widely applied smart card fare payment systems, a new method is proposed to infer the stops at which passengers holding smart cards board the bus from smart card fare data and bus schedules. The method first classifies two sequential swipes to decide whether they occur at the same stop with naive Bayes classifier. Travel times are then estimated from the naive Bayes classifier results using maximum likelihood estimation, dynamic programming and quadratic programming methods. To solve the problem with imprecise initial parameters, a coordinate descent method is applied. It updates parameters and estimates values alternatively until convergence. An experiment is designed to test this algorithm with realworld data, and it proves that the error of this method is small and the convergence is fast.

Key words: public transit system, public transit smart card, naive Bayes classifier, dynamic programming, quadratic programming, coordinate descent method